Computing Hough transforms on hypercube multicomputers
نویسندگان
چکیده
منابع مشابه
A Probabilistic Algorithm for Computing Hough Transforms
The Hough transform is a common technique in computer vision and pattern recognition for recognizing patterns of points. We describe an efficient probabilistic algorithm for a Monte-Carlo approximation to the Hough transform. Our algorithm requires substantially less computation and storage than the standard Hough transform when applied to patterns that are easily recognized by humans. The prob...
متن کاملImage Template Matching on MIMD Hypercube Multicomputers
Efficient algorithms for image template matching on fine grained as well as medium grained MIMD hypercube multicomputers are developed. The medium grained MIMD algorithm is developed specifically for the NCUBE multicomputer. This algorithm is compared experimentally with an algorithm that is optimized for the Cray 2 supercomputer.
متن کاملActive Pixel Merging on Hypercube Multicomputers
This paper presents algorithms developed for pixel merging phase of object space parallel polygon rendering on hypercube connected multicomputers These algorithms reduce volume of communication in pixel merging phase by only exchanging local foremost pixels In order to avoid message fragmentation local foremost pixels should be stored in consecutive memory locations An algorithm called modi ed ...
متن کاملFault-Tolerant Sorting Algorithm on Hypercube Multicomputers
In this paper, algorithmic fault-tolerant techniques are introduced for sorting algorithms on n-dimensional hypercube multi-computers. We propose a fault-tolerant sorting algorithm that can tolerate up to n-1 faulty processors. Fit, we indicate that the bitouic sorting algorithm cau perform sorting operations correctly on hypercubes with one faulty processor. In order to tolerate up to rsn-1 fa...
متن کاملA Reliable Sorting Algorithm on Hypercube Multicomputers
In this paper, we present an algorithm-based fault-tolerant technique, namely the median-splitting strategy, for designing a reliable sorting algorithm. Combining the median-splitting strategy with bitonic sorting algorithm, a reliable sorting algorithm is proposed on the hypercube multicomputers. By the strategies of duplicating data and rollback, the proposed algorithm can detect transient fa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Supercomputing
سال: 1990
ISSN: 0920-8542,1573-0484
DOI: 10.1007/bf00127879